Interpolation by lattice polynomial functions: A polynomial time algorithm
نویسندگان
چکیده
منابع مشابه
A Parallel Algorithm for Interval Polynomial Interpolation
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinations of interval nodes are used. The high computational complexity makes it necessary to perform the computation parallelly. In this paper, we report a parallel algorithm which effectively perform the combinatorical com...
متن کاملNote on Polynomial Interpolation to Analytic Functions.
last upper and lower molars. Chumashius balchi cannot, therefore, be regarded as occurring in the direct line of development leading upward to the Recent tarsier. In lower dental formula Chumashius exhibits a closer relationship to Omomys and Hemi4codon than to Anaptomorphus and Tetonius. The character of the lower posterior premolars in Uintanius suffice to remove this Bridger genus from any c...
متن کاملA Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle calls is bounded by a polynomial in the size of the underlying set.
متن کاملA Polynomial Time SAT Algorithm
An algorithm of two parts is presented that determines existence of and instance of an assignment satisfying of instances of SAT. The algorithm employs an unconventional approach premised on set theory, which does not use search or resolution, to partition the set of all assignments into nonsatisfying and satisfying assignments. The algorithm, correctness, and time and space complexity proofs a...
متن کاملA Polynomial-Time Slicing Algorithm
In an earlier work, we have introduced slicing for Abstract State Machines (ASMs). The idea of this concept is analogous to the one of program slicing which is an established technique for extracting statements from a program that are relevant for its behaviour at a given point of interest. These statements form again a syntactically correct program called a slice. We have identified a class of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Sets and Systems
سال: 2019
ISSN: 0165-0114
DOI: 10.1016/j.fss.2018.12.009